Exponential speedup of quantum newton optimization algorithm for general polynomials
نویسندگان
چکیده
منابع مشابه
Exponential algorithmic speedup by quantum walk Andrew
Andrew M. Childs,1, ∗ Richard Cleve,2, † Enrico Deotto,1, ‡ Edward Farhi,1, § Sam Gutmann,3, ¶ and Daniel A. Spielman4, ∗∗ Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA Department of Computer Science, University of Calgary, Calgary, Alberta, Canada T2N 1N4 Department of Mathematics, Northeastern University, Boston, MA 02115, USA Department of Ma...
متن کاملSIZING OPTIMIZATION OF TRUSS STRUCTURES WITH NEWTON META-HEURISTIC ALGORITHM
This study is devoted to discrete sizing optimization of truss structures employing an efficient discrete evolutionary meta-heuristic algorithm which uses the Newton gradient-based method as its updating scheme and it is named here as Newton Meta-heuristic Algorithm (NMA). In order to enable the NMA population-based meta-heuristic to effectively explore the discrete design space, a term contain...
متن کاملEigenvector approximation leading to exponential speedup of quantum eigenvalue calculation.
We present an efficient method for preparing the initial state required by the eigenvalue approximation quantum algorithm of Abrams and Lloyd. Our method can be applied when solving continuous Hermitian eigenproblems, e.g., the Schrödinger equation, on a discrete grid. We start with a classically obtained eigenvector for a problem discretized on a coarse grid, and we efficiently construct, quan...
متن کاملSpeedup in Quantum Adiabatic Evolution Algorithm
Quantum adiabatic evolution algorithm suggested by Farhi et al. was effective in solving instances of NP-complete problems. The algorithm is governed by the adiabatic theorem. Therefore, in order to reduce the running time, it is essential to examine the minimum energy gap between the ground level and the next one through the evolution. In this letter, we show a way of speedup in quantum adiaba...
متن کاملTunneling and Speedup in Quantum Optimization for Permutation-Symmetric Problems
Siddharth Muthukrishnan, Tameem Albash, and Daniel A. Lidar Department of Physics and Astronomy, University of Southern California, Los Angeles, California 90089, USA Center for Quantum Information Science and Technology, University of Southern California, Los Angeles, California 90089, USA Information Sciences Institute, University of Southern California, Marina del Rey, Califirona 90292, USA ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Physics, Mechanics & Astronomy
سال: 2021
ISSN: ['1869-1927', '1674-7348']
DOI: https://doi.org/10.1007/s11433-021-1769-1